Probabilistic graphs using coupled random variables
نویسندگان
چکیده
Neural network design has utilized flexible nonlinear processes which can mimic biological systems, but has suffered from a lack of traceability in the resulting network. Graphical probabilistic models ground network design in probabilistic reasoning, but the restrictions reduce the expressive capability of each node making network designs complex. The ability to model coupled random variables using the calculus of nonextensive statistical mechanics provides a neural node design incorporating nonlinear coupling between input states while maintaining the rigor of probabilistic reasoning. A generalization of Bayes rule using the coupled product enables a single node to model correlation between hundreds of random variables. A coupled Markov random field is designed for the inferencing and classification of UCI’s MLR ‘Multiple Features Data Set’ such that thousands of linear correlation parameters can be replaced with a single coupling parameter with just a (3%, 4%) reduction in (classification, inference) performance.
منابع مشابه
SOME PROBABILISTIC INEQUALITIES FOR FUZZY RANDOM VARIABLES
In this paper, the concepts of positive dependence and linearlypositive quadrant dependence are introduced for fuzzy random variables. Also,an inequality is obtained for partial sums of linearly positive quadrant depen-dent fuzzy random variables. Moreover, a weak law of large numbers is estab-lished for linearly positive quadrant dependent fuzzy random variables. Weextend some well known inequ...
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملCS 6782: Fall 2010 Probabilistic Graphical Models
In a probabilistic graphical model, each node represents a random variable, and the links express probabilistic relationships between these variables. The structure that graphical models exploit is the independence properties that exist in many real-world phenomena. The graph then captures the way in which the joint distribution over all of the random variables can be decomposed into a product ...
متن کاملDirected graphical models
for some functions f and g. Probabilistic graphical models are a way of representing conditional independence assumptions using graphs. Nodes represent random variables and lack of edges represent conditional independence assumptions, in a way which we will define below. There are many kinds of graphical model, but the two most popular are Bayesian (belief) networks1, which are based on directe...
متن کاملProbabilistic prototype models for attributed graphs
This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are annotated by random variables. Every node/edge has two random processes associated with itoccurence probability and the probability distribution over the attr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1404.6955 شماره
صفحات -
تاریخ انتشار 2014